The Two Ear Theorem on Matching-Covered Graphs
نویسنده
چکیده
We give a simple and short proof for the two ear theorem on matchingcovered graphs which is a well-known result of Lovász and Plummer. The proof relies only on the classical results of Tutte and Hall on the existence of perfect matching in (bipartite) graphs.
منابع مشابه
Ear Decompositions in Combed Graphs
We introduce the concept of combed graphs and present an ear decomposition theorem for this class of graphs. This theorem includes the well known ear decomposition theorem for matching covered graphs proved by Lovász and Plummer. Then we use the ear decomposition theorem to show that any two edges of a 2-connected combed graph lie in a balanced circuit of an equivalent combed graph. This result...
متن کاملBrick Generation and Conformal Subgraphs
A nontrivial connected graph is matching covered if each of its edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played key roles in the theory of these graphs. Any tight cut decomposition of a matching covered graph results in an essentially unique list of special matching covered graphs, call...
متن کاملUnmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملMatching structure of symmetric bipartite graphs and a generalization of Pólya's problem
A bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. This paper investigates matching structure of symmetric bipartite graphs. We first apply the Dulmage-Mendelsohn decomposition to a symmetric bipartite graph. The resulting components, which are matching-covered, turn out to have symmetry. We then decompose a matching-covered bipartite graph via an ear de...
متن کاملMatching Covered Graphs with Three Removable Classes
The notion of removable classes arises in connection with ear decompositions of matching covered graphs introduced by Lovász and Plummer. The last (single or double) ear of an ear decomposition is defined as a removable class. Every matching covered graph not induced by a circuit has at least three removable classes. In this paper, we characterize matching covered graphs with precisely three re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 74 شماره
صفحات -
تاریخ انتشار 1998